Automata theory - PDFSEARCH.IO - Document Search Engine

Automata theory
Results: 1263

#	Item
631	Expressive Power of Cost Logics over Infinite Words Denis Kuperberg1 Michael Vanden Boom2 Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2012-10-25 13:52:50 Mathematics Computer science Star height Alphabet Regular language Formal languages Automata theory Theoretical computer science
632	Regular Temporal Cost Fun tions Thomas Col ombet1 , Denis Kuperberg1 , Sylvain Lombardy2 1 Liafa/CNRS/Université Paris 7, Denis Diderot, Fran e Ligm - Université Paris-Est Marne-la-Vallée, Fran e Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2012-10-25 13:52:51 Semigroup theory Mathematics Semigroup Metre Semiautomaton Automata theory Formal languages Category theory
633	Quasi-Weak Cost Functions A New Variant of Weakness Achim Blumensath1 Thomas Colcombet2 Denis Kuperberg3 Christof L¨oding4 Pawel Parys3 Michael Vanden Boom5 1 TU Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2014-04-30 05:09:51 Formal languages Computer science Nondeterministic finite automaton Finite-state machine Regular language Ω-automaton Automata theory Models of computation Theoretical computer science
634	A Note on Phase Transitions and Computational Pitfalls of Learning from Sequences Antoine Cornu´ejols1 & Mich`ele Sebag2 1 AgroParisTech / INRA Add to Reading List Source URL: eprints.pascal-network.org Language: English - Date: 2008-01-16 05:03:29 Computer science Applied mathematics Deterministic finite automaton Finite-state machine Grammar induction Algorithm Sequence Powerset construction Automata theory Models of computation Theoretical computer science
635	Andy Wuensche Discrete Dynamics Lab Visiting Fellow, Dept. of Informatics (formerly COGS) Univ. of Sussex Complex dynamics, basins of attraction, and Add to Reading List Source URL: uncomp.uwe.ac.uk Language: English - Date: 2008-05-05 07:58:22 Logic Cellular automaton Cellular automata Rule 90 Christopher Langton Dynamical system Chaos theory Abstraction Systems theory Science Bioinformatics Boolean network
636	Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, France Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2013-07-10 12:10:51 Ω-automaton Büchi automaton Tree automaton Star height Alternating finite automaton Muller automaton Automata theory Theoretical computer science Computer science
637	Comment ompter ave LTL Denis Kuperberg Liafa/CNRS/Université Paris 7, Denis Diderot, Fran e Réunion FREC - 10 mai 2011 Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2012-10-25 13:52:50
638	Automata theory Regular Cost Functions Formalisms on finite words Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2014-05-22 04:28:13 Mathematics Applied mathematics Regular language Aperiodic monoid Star-free language Finite-state machine Krohn–Rhodes theory Deterministic pushdown automaton Automata theory Formal languages Theoretical computer science
639	Nondeterminism in the Presence of Diverse or Unknown Future. U. Boker1 , D. Kuperberg2,3 , O. Kupferman2 , M. Skrzypczak3 1 IST 2 Hebrew Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2014-01-07 04:43:59 Models of computation Mathematics Automata theory FO Finite model theory
640	An automaton model for forest algebras. Antoine Delignat-Lavaud An automaton model for Add to Reading List Source URL: antoine.delignat-lavaud.fr Language: English - Date: 2010-08-31 10:20:39 Formal languages Algebra Mathematics Category theory Algebraic structures Syntactic monoid Regular language Monoid Monad Abstract algebra Automata theory Semigroup theory

UPDATE